Zariski density and computing in arithmetic groups
نویسندگان
چکیده
منابع مشابه
Zariski density and computing in arithmetic groups
For n > 2, let Γn denote either SL(n,Z) or Sp(n,Z). We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group H ≤ Γn. This forms the main component of our methods for computing with such arithmetic groups H. More generally, we provide algorithms for computing with Zariski dense groups in Γn. We use our GAP implementation of the algori...
متن کاملComputing with Arithmetic Groups
1 PAIRS OF DUAL CONES Around 1900 Voronoï [10] formulated his fundamental algorithm to enumerate all similarity classes of perfect lattices in a given dimension. This algorithm has far reaching generalisations ([7], [6], [4]) used to compute generators and relators for arithmetic groups. A quite general situation, where one may apply Voronoï’s algorithm, is described in [7]: Let σ : V1 ×V2 → R ...
متن کاملComputing arithmetic Kleinian groups
Arithmetic Kleinian groups are arithmetic lattices in PSL2(C). We present an algorithm that, given such a group Γ, returns a fundamental domain and a finite presentation for Γ with a computable isomorphism.
متن کاملCompleteness in Zariski Groups
Zariski groups are @0-stable groups with an axiomatically given Zariski topology and thus abstract generalizations of algebraic groups. A large part of algebraic geometry can be developed for Zariski groups. As a main result, any simple smooth Zariski group interprets an algebraically closed eld, hence is almost an algebraic group over an algebraically closed eld.
متن کاملOn Arithmetic Zariski Pairs in Degree 6
We define a topological invariant of complex projective plane curves. As an application, we present new examples of arithmetic Zariski pairs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2017
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3236